Institutions,information, and commitment: the role of democracy in conflict

This paper explores the hypothesis that both the preexisting quality of democracy in a polity at the onset of conflict and the quality of democracy expected to emerge in the aftermath influence the likelihood of civil war. An empirical investigation of the hypothesis presents a challenge due to concerns of endogeneity and selection: the post-conflict level of democracy is endogenous to the pre-conflict level. Further, for a given time period, either a number of countries have not experienced civil war; or if they did, did not resolve the conflict. We overcome this selection bias by implementing a three-step extension to the Heckman procedure using an unbalanced cross-country panel of 77 countries over the period 1971–2005. Consistent with our hypothesis, we find that a standard deviation improvement in the existing level of democracy reduces the probability of civil war by approximately 9 percentage points and a corresponding improvement in expected post-conflict democratization increases the probability of conflict by approximately 48 percentage points.     

Modeling and analyzing multiple station baggage screening security system performance

In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

对潜搜索的灰色整数规划模型

在对潜搜索中,针对搜索兵力武器装备战技性能的优劣、指挥人员的军政素质的高低、水文气象条件的好坏等因素均会随着时间的推移而发生变化的特点,为了取得最佳的搜潜效果,需要根据时间变化给不同的作战单元分派不同的作战任务.将整数规划与灰色模型相结合,建立了对潜搜索的灰色整数规划模型,给出了检验方法和求解步骤,并举例分析说明.经验证,该模型精度等级较高,且能使各作战单元的搜索效率达到最佳,因此,可资对潜搜索兵力分配时借鉴.     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

数字水印技术在高分辨率遥感数据安全保护中的应用

随着高分辨率遥感数据应用的不断扩展,其安全和版权问题也日益突出。利用数字水印技术保护高分辨率遥感数据安全是目前可行、可靠的技术手段。介绍了数字水印基本原理并分析了高分辨率遥感数据数字水印特征,研究了数字水印技术在高分辨率遥感数据安全分发管理、网络发布等方面的应用,探讨了高分辨率遥感数据数字水印系统设计,并对高分辨率遥感数据数字水印技术进行了展望。     

基于一维距离像的导弹目标运动特征提取方法

根据导弹目标运动方式及其回波特点,提出了一种基于一维距离像的运动目标特征提取方法。在对回波进行全去斜率处理后获得目标一维像。通过观测一维像序列的长度变化周期,提取目标的章动频率;根据距离像在成像窗口中的位置,获取雷达和目标的径向距离;利用相邻距离像相关方法,获取距离像平移位置,从而推出雷达—目标的径向速度。进行了相应的仿真实验,结果表明了该方法的有效性。     

基于整数小波变换的多光谱遥感图像压缩技术

在分析多光谱图像小波变换后系数特点的基础上,提出了一种基于整数小波变换的3维集合分裂嵌入块编码(3D SPECK)压缩方法。该方法将小波变换压缩技术中的零树编码推广到多光谱图像压缩中,采用整数小波变换去除空间冗余,对单波段图像,采用2D SPECK编码,对多波段图像,谱域上构成的小波矢量采用离散余弦变换(DCT)进行变换,对变换后的系数进行3D SPECK编码。实验结果表明,该方法硬件实现简单,编码解码时间快,对内存要求低。     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Integrated capacity,demand, and production planning with subcontracting and overtime options

Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

一种新的高分辨极化目标检测方法

针对宽带毫米波高分辨雷达体制 ,研究了杂波环境中的目标检测问题。提出了极化域线性积累滤波的思路以提高雷达接收信号的信杂比 ,在此基础上利用宽带波形固有的径向高分辨力对目标进行一维距离成像 ,估计出回波中强散射点的数量和分布 ,通过对不同径向分辨单元内的强散射点进行整体检测 ,可进一步有效地提高信杂比 ,改善雷达的检测性能。最后在毫米波段的实验仿真结果表明该方法是一种非常有效的扩展目标检测方法